Degenerate Saccheri Quadrilaterals, Möbius Transformations and Conjugate Möbius Transformations
نویسندگان
چکیده
منابع مشابه
On iterates of Möbius transformations on fields
Let p be a quadratic polynomial over a splitting field K, and S be the set of zeros of p. We define an associative and commutative binary relation on G ≡ K∪{∞}−S so that every Möbius transformation with fixed point set S is of the form x “plus” c for some c. This permits an easy proof of Aitken acceleration as well as generalizations of known results concerning Newton’s method, the secant metho...
متن کاملRobust ILC design using Möbius transformations
Abstract: In this paper a general ILC algorithm is examined and it is found that the filters involved can be selected to satisfy frequency-wise uncertainty limits on the plant model. The probability of the plant model being at a given point in the uncertainty space is specified, and the filters are then chosen to maximise the convergence rate that can be expected in practice. The magnitude of t...
متن کاملMöbius Transformations For Global Intrinsic Symmetry Analysis
The goal of our work is to develop an algorithm for automatic and robust detection of global intrinsic symmetries in 3D surface meshes. Our approach is based on two core observations. First, symmetry invariant point sets can be detected robustly using critical points of the Average Geodesic Distance (AGD) function. Second, intrinsic symmetries are self-isometries of surfaces and as such are con...
متن کاملApollonius tenth problem via radius adjustment and Möbius transformations
The Apollonius Tenth Problem, as defined by Apollonius of Perga circa 200 B.C., has been useful for various applications in addition to its theoretical interest. Even though particular cases have been handled previously, a general framework for the problem has never been reported. Presented in this paper is a theory to handle the Apollonius Tenth Problem by characterizing the spatial relationsh...
متن کاملOptimal Möbius Transformations for Information Visualization and Meshing
We give linear-time quasiconvex programming algorithms for finding a Möbius transformation of a set of spheres in a unit ball or on the surface of a unit sphere that maximizes the minimum size of a transformed sphere. We can also use similar methods to maximize the minimum distance among a set of pairs of input points. We apply these results to vertex separation and symmetry display in spherica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Electronic Journal of Geometry
سال: 2017
ISSN: 1307-5624
DOI: 10.36890/iejg.545044